Circumscription Revisited An Analysis of Maori Reduplication

نویسنده

  • Paul de Lacy
چکیده

It is argued that the process of circumscription must be reintroduced to current theories of prosodic morphology, specifically to Correspondence Theory. This notion has broader effects than the serial circumscriptive process, affecting concepts of categorisation within the grammar, as shown by discussion of the notion ‘base of reduplication’. The reduplicative processes of the Maori language are analysed in this regard, and a hitherto unrecognised type of reduplication in this language is identified. Various other aspects of current phonological and morphological interest, such as lexical organisation, are also discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pointwise Circumscription Revisited

A decade ago, Pointwise Circumscription was proposed as a tool for formalizing common sense. In this paper, we revisit some of its uses and examine some cases in which it does not yield the intended behavior. Specifically, we explore the cases in which unsatisfiability may result from the presence of multiple minimal models (for McCarthy’s Circumscription). Then, we present a form of circumscri...

متن کامل

Computing Circumscriptive Databases by Integer Programming: Revisited

In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axioms and unique name axioms. This kind of treatment is very important since this enable to apply various technique developed in operations research to nonmonotonic reasoning. (Nerode et al., 1995) are the first to propose...

متن کامل

Computing Circumscriptive Databases by Integer Programming: Revisited (Extended Abstract)

In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axioms and unique name axioms. This kind of treatment is very important since this enable to apply various technique developed in operations research to nonmonotonic reasoning. (Nerode et al., 1995) are the first to propose...

متن کامل

Computing Circumscription Revisited: Preliminary Report

We provide a general method which can be used in an algorithmic manner to reduce certain classes of 2nd-order circumscription axioms to logically equivalent 1st order formulas The algorithm takes as input an arbitrary 2nd-order formula and either returns as output an equivalent 1st order formula, or terminates wi th failure In addition to demonstrating the algor i thm by applying it to various ...

متن کامل

Chaos and Complexity in Financial Statements

Conceptual issues and the basis for the use of financial statements from the perspective of complexity and chaos are proposed. After analyzing the implications that these perspectives have for financial statements, basic accounting equation is examined from the view of complex logic through the mechanisms of the circumscription. Besides, the phase spaces arising from the relationship between in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996